Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
161	Maximizing the Guarded Boundary of an Art Gallery is APX-complete Euripides Markou1, Stathis Zachos1,2 and Christodoulos Fragoudakis1 1 Computer Science, ECE, National Technical University of Athens Add to Reading List Source URL: emarkou.users.uth.gr Language: English - Date: 2016-05-24 11:28:43 Mathematics Computational complexity theory Geometry Polygons NP-complete problems Euclidean plane geometry Art gallery problem Computational geometry Vertex APX
162	Synchronous Counting and Computational Algorithm Design Danny Dolev1 , Janne H. Korhonen2 , Christoph Lenzen3 , Joel Rybicki2 , and Jukka Suomela2 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:08 Computing Computational complexity theory Mathematics Theoretical computer science Distributed computing Routing algorithms Consensus Algorithm Randomized algorithm Leader election A* search algorithm
163	CS711008Z Algorithm Design and Analysis Lecture 2. Analysis techniques 1 Dongbo Bu Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Analysis of algorithms Theory of computation Computational complexity theory Computer science Theoretical computer science Quicksort Average-case complexity Best worst and average case Algorithm Sorting algorithm Time complexity Worst-case complexity
164	Sound Proof of Proximity of Knowledge Serge Vaudenay ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE Add to Reading List Source URL: security-lab.jaist.ac.jp Language: English - Date: 2015-11-22 02:25:24 Cryptography IP Distance-bounding protocol Challengeresponse authentication Computational complexity theory Interactive proof system
165	Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2015-11-09 10:22:02 Theoretical computer science Computational complexity theory Mathematics Constraint programming NP-complete problems Boolean algebra Parameterized complexity Boolean satisfiability problem Constraint satisfaction problem Exponential time hypothesis Treewidth Tree decomposition
166	New Hardness Results for Diophantine Approximation Friedrich Eisenbrand & Thomas Rothvoß Institute of Mathematics EPFL, Lausanne Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Computational complexity theory Diophantine approximation Approximation algorithm
167	Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines! Paul C. Bell1 and Prudence W.H. Wong2 1 Department of Computer Science, Loughborough University. Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2011-05-17 19:43:16 Computational complexity theory Scheduling Operations research Computer science Theory of computation Combinatorial optimization Mathematical optimization Parallel computing Multiprocessor scheduling NC Multi-core processor Randomized algorithm
168	Chapter 1 Online Scheduling Susanne Albers University of Freiburg, Germany Add to Reading List Source URL: www14.in.tum.de Language: English - Date: 2013-11-25 10:58:01 Scheduling Computational complexity theory Operations research Mathematics Applied mathematics Analysis of algorithms Online algorithms Combinatorial optimization Makespan Job shop scheduling Algorithm Randomized algorithm
169	A Compendium on Steiner Tree Problems Editors: M. Hauptmann and M. Karpinski Department of Computer Science and Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2015-04-27 05:26:50 Computational complexity theory Graph theory Mathematics NP-complete problems Steiner tree problem Approximation algorithm APX Spanning tree Optimization problem Wiener connector Travelling salesman problem

UPDATE